\documentclass{sig-alternate}

\usepackage{latexsym}
\usepackage{amsmath,amssymb,pifont,graphicx,epstopdf,float}
\usepackage{comment,epsfig,subfigure,url,latexsym,cite,amsfonts}
\usepackage{algorithm}
\usepackage{algorithmic}
\usepackage{enumerate}
%\usepackage{amsthm,color,amsfonts,times,fullpage,framed,epsf,hyperref}

\newcommand{\subparagraph}{}
\usepackage[small,compact]{titlesec}
%\usepackage[small,it]{caption}
\usepackage{balance}
\usepackage{times}

\newcommand{\squish}{
        \setlength{\topsep}{0pt}
        \setlength{\itemsep}{0ex}
        \vspace{-1ex}
        \setlength{\parskip}{0pt}}
\newcommand{\squishlist}{
 \begin{list}{$\bullet$}
  { \setlength{\itemsep}{0pt}
     \setlength{\parsep}{3pt}
     \setlength{\topsep}{3pt}
     \setlength{\partopsep}{0pt}
     \setlength{\leftmargin}{1.5em}
     \setlength{\labelwidth}{1em}
     \setlength{\labelsep}{0.5em} } }

\newcommand{\squishlisttwo}{
 \begin{list}{$\bullet$}
  { \setlength{\itemsep}{0pt}
     \setlength{\parsep}{0pt}
    \setlength{\topsep}{0pt}
    \setlength{\partopsep}{0pt}
    \setlength{\leftmargin}{2em}
    \setlength{\labelwidth}{1.5em}
    \setlength{\labelsep}{0.5em} } }

\newcommand{\squishend}{
  \end{list}  }
%\newcommand{\xxx}[1]{\textcolor{red}{#1}}

\newtheorem{claim}{Claim}
\newtheorem{lemma}{Lemma}
\newtheorem{definition}{Definition}
\newtheorem{corollary}[lemma]{Corollary}
\newtheorem{theorem}[lemma]{Theorem}

%\newtheorem{theorem}{Theorem}[section]
%\newtheorem{corollary}[theorem]{Corollary}
%\newtheorem{proposition}[theorem]{Proposition}
%\newtheorem{lemma}[theorem]{Lemma}
%\newtheorem{claim}[theorem]{Claim}
%\newtheorem{remark}[theorem]{Remark}
%\theoremstyle{definition}\newtheorem{example}[theorem]{Example}
%\theoremstyle{definition}\newtheorem{definition}[theorem]{Definition}
%\theoremstyle{observation}\newtheorem{observation}[theorem]{Observation}

%\newcommand{\QED}{\mbox{}\hfill \rule{3pt}{8pt}\vspace{10pt}\par}
%newenvironment{proof}{\noindent \mbox{}{\bf Proof:}}{\QED}

%\newcommand{\comment}[1]{}
%\newcommand{\theoremref}[1]{(\ref{#1})}
%\def\polylog{\operatorname{polylog}}
%\newcommand{\algorithmsize}[0]{}

\begin{document}
\conferenceinfo{CIKM}{'11 Glasgow, UK}
\title{Multi-skill Collaborative Teams based on Densest Subgraphs}

%\author{
%Amita Gajewar \thanks{Yahoo! Inc, Santa Clara, CA, USA. \hbox{E-mail}:~{\tt amitag@yahoo-inc.com}.} 
%\and 
%Atish {Das Sarma} \thanks{Google Research, Google Inc., Mountain View, CA, USA. \hbox{E-mail}:~{\tt dassarma@google.com}. Part of the work done while at Georgia Institute of Technology, GA.}
%}

%\numberofauthors{2} 
%\author{
% The command \alignauthor (no curly braces needed) should
% precede each author name, affiliation/snail-mail address and
% e-mail address. Additionally, tag each line of
% affiliation/address with \affaddr, and tag the
% e-mail address with \email.
%
% 1st. author
%\alignauthor
%Amita Gajewar\\
%\affaddr{Yahoo! Inc}\\
%\affaddr{Santa Clara, CA, USA}\\
%\email{amitag@yahoo-inc.com}
%\alignauthor
%Atish {Das Sarma}\\
%\affaddr{Google Research, Google Inc.}\\
%\affaddr{Mountain View, CA, USA. }\\
%\email{dassarma@google.com}
%}

%\date{}

\maketitle

\begin{abstract}
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the social network may be an expert in one or more skills. Edge weights specify affinity or collaborative compatibility between respective nodes. Given a project that requires a set of specified number of skilled individuals in each area of expertise, the goal is to identify a team that maximizes the collaborative compatibility. For example, the requirement may be to form a team that has at least three databases experts and at least two theory experts. 

We explore team formation where the collaborative compatibility objective is measured as the density of the induced subgraph on selected nodes. The problem of maximizing density is NP-hard even when the team requires individuals of only one skill. We present a 3-approximation algorithm that improves upon a naive extension of the previously known algorithm for densest at least $k$ subgraph problem. 
%We further show how the same approximation can be extended to a special case of multiple skills. 
We show the same approximation can be extended to a special case of multiple skills. 
Our problem generalizes the formulation studied by Lappas et al. [KDD '09] who measure team compatibility in terms of diameter or spanning tree costs. 

Experiments are performed on a crawl of the DBLP graph where individuals can be skilled in at most four areas - theory, databases, data mining, and artificial intelligence. In addition to our main algorithm, we also present heuristic extensions to trade off between the size of the solution and its induced density. These density-based algorithms outperform the diameter-based objective on several metrics for assessing the collaborative compatibility of teams. The solutions suggested are also intuitively meaningful and scale well with the increase in the number of skilled individuals required. 
\end{abstract}

%\category{H.2.8}{Database Management}{Database Applications - Data Mining}
%\category{G.2.2}{Discrete Mathematics}{Graph Theory - Graph Algorithms}
%\keywords{Team Formation, Social Networks, Density, Algorithms, Graphs}

\graphicspath{{../version8/plots_3/}}

\input{introduction}

\input{relatedwork}

\input{problemdef}

\input{densityobjective}

\input{diameterobjective}

\input{experiments}

\input{futurework}

{
%\small
\scriptsize
\bibliographystyle{abbrv}
\bibliography{arxiv1}
}

%\input{appendix}

\end{document}